A Heuristic Algorithm Based on Line-up Competition and Generalized Pattern Search for Solving Integer and Mixed Integer Non-linear Optimization Problems
نویسندگان
چکیده
منابع مشابه
Optimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملA Heuristic Algorithm for Solving Mixed Integer Problems
The paper proposes a hybrid heuristic algorithm, which uses procedures for search of feasible integer directions with one or two nonzero components and linear optimization. This algorithm is iterative and it combines constructive and locally improving strategies for finding a new current solution. A subsequence of sub-problems is solved, aimed at seeking a feasible solution of the general Mixed...
متن کاملUse of Particle Swarm Optimization Algorithm for Solving Integer and Mixed Integer Optimization Problems
This paper presents use of Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart [1] for solving Integer and Mixed Integer Optimization problems. In PSO, The potential solutions, called particles, are flown through the problem space by learning from the current optimal particle and its memory. PSO is started with a group of feasible solutions and a feasibility function ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملSolving Integer and Mixed Integer Linear Problems with ABS Method
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Latin American Journal of Solids and Structures
سال: 2016
ISSN: 1679-7825
DOI: 10.1590/1679-78252293